An Lpo-based Termination Ordering for Higher-order Terms without -abstraction
نویسنده
چکیده
We present a new precedence-based termination ordering for (polymorphic) higher-order terms without-abstraction. The ordering has been designed to strictly generalize the lexicographic path ordering (on rst-order terms). It is relatively simple, but can be used to prove termination of many higher-order rewrite systems, especially those corresponding to typical functional programs. We establish the relevant properties of the ordering, include a number of examples, and also discuss certain limitations of the ordering and possible extensions.
منابع مشابه
Solving Gpo Ordering Constraints with a Shared Term Data Structure
We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. Constraint solving is done eeciently thanks to an original shared term data structure based on SOUR graphs. We show how the algorithm works for proving termination of self-embedding rules like ffx ! fgfx. For particular cases of gpo like lpo, the algorithm is fully automatic. We gi...
متن کاملSolving Partial Order Constraints for LPO Termination
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in dlog2 ne propositional variables and partial order constraints between symbols are modeled ...
متن کاملA Unified Ordering for Termination Proving
We introduce a reduction order called the weighted path order (WPO) that subsumes many existing reduction orders. WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by a wide class of interpretations. We investigate summations, polynomials and maximums for such interpretations. We show that KBO is a restricted case of WPO induced by summati...
متن کاملThe theory of total unary rpo is
The Recursive Path Ordering (rpo) is a syntactic ordering on terms that has been widely used for proving termination of term-rewriting systems 7,20]. How to combine term-rewriting with ordered resolution and paramodulation is now well-understood and it has been successfully applied in many theorem-proving systems 11,16,21]. In this setting an ordering such as rpo is used both to orient rewrite ...
متن کاملThe computability path ordering
This paper aims at carrying out termination proofs for simply typed higherorder calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols. A first version, core CPO, is essentially obtained from the higher-order recursive path ordering (HORPO) by elimina...
متن کامل